Fast Truck - Packing of 3 D boxes
نویسندگان
چکیده
The purpose of this research is to estimate the repair effects a repairable system undergoes repeated failures and repairs. Data was collected on a cement kiln incurring150 failures and 5 shutdowns for overhaul. Causes of failure were identified as operational, mechanical or electrical. The unit was restarted but with an (expected) improved failure rate by virtue of the repair. Repair improvements are modeled is a Kijima Type-II virtual age framework. Covariate data was also used to better estimate the failure/repair process. 2 Confidence-based Optimization for the Newsvendor Problem Roberto Rossi, Business School, University of Edinburgh, 29 Buccleuch place, EH8 9JS, Edinburgh, United Kingdom, [email protected], Steven Prestwich, Armagan Tarim, Brahim Hnich We consider a Newsvendor problem in which the decision maker is given a set of past demand samples. We employ confidence interval analysis in order to identify a range of candidate order quantities that, with prescribed confidence probability, includes the real optimal order quantity for the underling stochastic demand process with known distribution and unknown parameter(s). For these order quantities, we also produce cost upper and lower bounds. We apply our approach to Binomial, Poisson, and Exponential demand. For two of these distributions we discuss the case of unobserved lost sales. 3 Economic order quantity of an inventory control system with order backlog Eline De Cuypere, TELIN, University Ghent, St-Pietersnieuwstraat 41, 9000, Ghent, Belgium, [email protected], Koen De Turck, Dieter Fiems We present a mathematical model which evaluates the performance of inventory control systems with order backlog. In terms of cost, we account for holding, set-up and backlog costs. Production of units starts when the inventory level drops below the threshold value and stops when stock capacity is reached. Moreover, orders are backlogged and coupled to the completion of the units. The inventory problem is studied in a Markovian setting. Set-up times are phase-type distributed while order and product arrivals are modelled by a Markovian arrival process. 4 Two Modified Preventive Maintenance Models in a Finite Time Span with Failure Rate Reduction Chun-Yuan Cheng, Dept. of Industrial Engineering & Management, Chaoyang Univerisity of Technology, 168 Gifong E. Rd., Wufeng„ 413, Taichung County, Taiwan, [email protected], Min Wang, Mei-Ling Liu For a preventive maintenance (PM) model over a finite time span, shorter PM interval can result in a better expected total maintenance cost (TC). However, the original optimal PM policies shown in literature are obtained by searching the optimal PM interval over a constrained range. We propose two modified failure-rate-reduction optimal PM policies: one is developed by releasing the constraint of the PM interval searching range; another is constructed by postponing the starting time of the PM program based on the fact that equipment is not easily fail in the early stage of its useful life.
منابع مشابه
Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing
In this paper, we study the d-dimensional dynamic bin packing problem for general ddimensional boxes, for d ≥ 2. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. Our main result is a 3-competitive online algorithm. We further study the 2and 3-dimensional problem closely and improve the competitive ratios. Technically speaking, our d-d...
متن کاملMulti objective optimization of heterogeneous bin packaging using adaptive genetic approach
Objectives: The packing of goods in any industry is a tedious work. The proposed system evaluates the optimal packing and prediction of 3D bin packing maximize the maximize profit. Methods/Statistical Analysis: The Adaptive Genetic Algorithm (AGA) is used to solve the 3D single bin packing problem by getting the user input data such as number of bins, its size, shape, weight, and constraints if...
متن کاملExploiting Packing Components in General-Purpose Integer Programming Solvers
The problem of packing boxes into a large box is often a part of a larger problem. For example in furniture supply chain applications, one needs to decide what trucks to use to transport furniture between production sites and distribution centers and stores, such that the furniture fits inside. Such problems are often formulated and sometimes solved using generalpurpose integer programming solv...
متن کاملThe 3D-Packing by Meta Data Structure and Packing Heuristics
The three dimensional (3D) packing problem is to arrange given rectangular boxes in a rectangular box of the minimum volume without overlapping each other. As an approach, this paper introduces the system of three sequences of the box labels, the sequence-triple, to encode the topology of the 3Dpacking. The topology is the system of relative relations in pairs of boxes such as right-of, above, ...
متن کاملAn n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
In this paper we propose a simple recursive uniform algorithm for the problem of packing n-dimensional boxes into an n-container. We are particularly concerned about the special case n 1⁄4 3 where the boxes can be packed in a given subset of their six possible positionings. Our method studies symmetries in the packings by the use of an ordered set of three directed graphs with the same edges (a...
متن کاملA Tight Lagrangean Relaxation Bound for the Manufacturer's Pallet Loading Problem
In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes (l; w) and (w; l) into a larger rectangle (L;W ) without overlapping. This problem appears in the loading of identical boxes on pallets, namely the manufacturer’s pallet loading problem (MPL), as well as in package design and truck or rail car load...
متن کامل